CS 167 : Reading in Algorithms
نویسنده
چکیده
These notes give suggestions about questions to keep in mind when reading a paper, giving a presentation on a paper, or writing up your own research. These questions are meant largely as guidelines — not all of them will apply to every research paper, and different students will have different favored approaches for understanding a research paper. Here are the five most important questions. Examples, more details, and further questions are given in the subsequent sections.
منابع مشابه
The Impact of Code-Switching on Bilingual EFL Learners’ Reading Comprehension
This study sought to investigate the probable effects of code-switching (CS) on Iranian bilingual English learners' reading comprehension. In this study, two intact classes of freshmen, taking the four-credit Reading and Comprehension Course 1, comprising a total of 70 participants, with 35 in each class, were randomly assigned as the experimental and the control groups after their initial homo...
متن کاملSecurity of Sponge structures
Sponge structure is a structure widely used in the design of cryptographic algorithms that reduces the design of the algorithms to the design of a permutation or pseudo-random function. The development of sponge-based algorithms and the selection of designs based on this structure in SHA3 and CAESAR competitions increase the need to examine its security against various types of attacks. In the ...
متن کاملCS 167 : Reading in Algorithms Triangle - Dense Graphs ∗
In these notes we discuss a paper of Gupta, Roughgarden, and Seshadhri, “Decompositions of Triangle-Dense Graphs” [1]. The motivation of the paper is to develop a theory of algorithms for social networks, like the graphs derived from Facebook or Twitter data mentioned in the first lecture. That is, the goal is to develop graph algorithms that work well on social networks, if not on worst-case g...
متن کاملInfering population history with DIY ABC: a user-friendly approach to Approximate Bayesian Computation
Department of Epidemiology and Public Health, Imperial College, St Mary’s Campus Norfolk Place, London W2 1PG, U.K. Centre de Biologie et de Gestion des Populations,INRA, Campus International de Baillarguet, CS 30016 Montferriersur-Lez, 34988 Saint-Gély-du-Fesc Cedex, France School of Biological Sciences, Lyle Building, The University of Reading Whiteknights, Reading RG6 6AS, UK CEREMADE, Unive...
متن کاملCS 167 : Reading in Algorithms Counting Triangles ∗
In these notes we discuss the earlier sections of a paper of Suri and Vassilvitskii, with the great title “Counting Triangles and the Curse of the Last Reducer” [2]. It is a good example of an applied paper with interesting algorithmic content. Consider an unweighted, undirected graph G = (V,E). G could be anything, but the authors are motivated by graphs derived from social networks. For examp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014